Polynomial identities on eigenforms
نویسندگان
چکیده
منابع مشابه
On Derandomizing Tests for Certain Polynomial Identities
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
متن کاملPolynomial identities for partitions
For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...
متن کاملInterprocedurally Analyzing Polynomial Identities
Since programming languages are Turing complete, it is impossible to decide for all programs whether a given non-trivial semantic property is valid or not. The way-out chosen by abstract interpretation is to provide approximate methods which may fail to certify a program property on some programs. Precision of the analysis can be measured by providing classes of programs for which the analysis ...
متن کاملPolynomial Identities for Hypermatrices
We develop an algorithm to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley–Hamilton theorem for hypermatrices.
متن کاملPolynomial Identities in Smash Products
Suppose that a group G acts by automorphisms on a (restricted) Lie algebra L over a field K of positive characteristic. This gives rise to smash products U(L)#K[G] and u(L)#K[G] . We find necessary and sufficient conditions for these smash products to satisfy a nontrivial polynomial identity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2016
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2015.06.006